Privacy Amplification and Nonmalleable Extractors Via Character Sums
نویسندگان
چکیده
منابع مشابه
Extractors Using Hardness Amplification
Zimand [24] presented simple constructions of locally computable strong extractors whose analysis relies on the direct product theorem for one-way functions and on the Blum-Micali-Yao generator. For N -bit sources of entropy γN , his extractor has seed O(logN) and extracts N random bits. We show that his construction can be analyzed based solely on the direct product theorem for general functio...
متن کاملTwo-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols
This paper offers the following contributions: • We construct a two-source extractor for quasi-logarithmic min-entropy. That is, an extractor for two independent n-bit sources with min-entropy Õ(log n). Our construction is optimal up to poly(log log n) factors and improves upon a recent result by Ben-Aroya, Doron, and Ta-Shma (ECCC’16) that can handle min-entropy log n · 2 √ log . • A central p...
متن کاملFinite Trigonometric Character Sums via Discrete Fourier Analysis
We prove several old and new theorems about finite sums involving characters and trigonometric functions. These sums can be traced back to theta function identities from Ramanujan’s notebooks and were systematically first studied by Berndt and Zaharescu; their proofs involved complex contour integration. We show how to prove most of Berndt–Zaharescu’s and some new identities by elementary metho...
متن کاملLinear Codes and Character Sums
Let V be an rn-dimensional linear subspace of Zn 2 . Suppose the smallest Hamming weight of non-zero vectors in V is d. (In coding-theoretic terminology, V is a linear code of length n, rate r and distance d.) We settle two extremal problems on such spaces. First we prove a (weak form) of a conjecture by Kalai and Linial and show that the fraction of vectors in V with weight d is exponentially ...
متن کاملLarge Character Sums
where χ is a non-principal Dirichlet character χ (mod q). It is easy to show that such character sums are always ≤ q in absolute value, while G. Pólya and I.M. Vinogradov (see [3]) improved this to≤ √q log q around 1919, and H.L. Montgomery and R.C. Vaughan [13] to √q log log q in 1977, assuming the Generalized Riemann Hypothesis (GRH). Up to the constant this is “best possible” since R.E.A.C. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/120868414